Continuous mappings between general systems
نویسندگان
چکیده
منابع مشابه
Generating Continuous Mappings with Lipschitz Mappings
If X is a metric space then CX and LX denote the semigroups of continuous and Lipschitz mappings, respectively, from X to itself. The relative rank of CX modulo LX is the least cardinality of any set U \LX where U generates CX . For a large class of separable metric spaces X we prove that the relative rank of CX modulo LX is uncountable. When X is the Baire space NN, this rank is א1. A large pa...
متن کاملSomewhat pairwise fuzzy $alpha$-irresolute continuous mappings
The concept of somewhat pairwise fuzzy $alpha$-irresolute continuous mappings and somewhat pairwise fuzzy irresolute $alpha$-open mappings have been introduced and studied. Besides, some interesting properties of those mappings are given.
متن کاملOn tension-continuous mappings
Tension-continuous (shortly TT ) mappings are mappings between the edge sets of graphs. They generalize graph homomorphisms. From another perspective, tension-continuous mappings are dual to the notion of flow-continuous mappings and the context of nowhere-zero flows motivates several questions considered in this paper. Extending our earlier research we define new constructions and operations f...
متن کاملFuzzy almost generalized $e$-continuous mappings
In this paper, we introduce and characterize the concept of fuzzy almost generalized $e$-continuous mappings. Several interesting properties of these mappings are also given. Examples and counter examples are also given to illustrate the concepts introduced in the paper. We also introduce the concept of fuzzy $f T_{frac{1}{2}}e$-space, fuzzy $ge$-space, fuzzy regular $ge$-space and fuzzy gener...
متن کاملInformation systems revisited - the general continuous case
In this paper a new notion of continuous information system is introduced. It is shown that the information systems of this kind generate exactly the continuous domains. The new information systems are of the same logic-oriented style as the information systems first introduced by Scott in 1982: they consist of a set of tokens, a consistency predicate and an entailment relation satisfying a set...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 1990
ISSN: 0895-7177
DOI: 10.1016/0895-7177(90)90147-f